منابع مشابه
Partial list colorings
Suppose G is an s-choosable graph with n vertices, and every vertex of G is assigned a list of t colors. We conjecture that at least t s · n of the vertices of G can be colored from these lists. We provide lower bounds and consider related questions. For instance we show that if G is χ-colorable (rather than being s-choosable), then more than ( 1 − ( χ−1 χ )t) · n of the vertices of G can be co...
متن کاملExtending Hall's Theorem into List Colorings: A Partial History
In 1988, A. J. W. Hilton and P. D. Johnson Jr. found a natural generalization of the condition in Philip Hall’s celebrated theorem on systems of distinct representatives. This generalization was formed in the relatively new theory of list colorings of graphs. Here we give an account of a strand of development arising from this generalization, concentrating on extensions of Hall’s theorem. New r...
متن کاملA new lower bound for the list update problem in the partial cost model
The optimal competitive ratio for a randomized online list update algorithm is known to be at least 1.5 and at most 1.6, but the remaining gap is not yet closed. We present a new lower bound of 1.50084 for the partial cost model. The construction is based on game trees with incomplete information, which seem to be generally useful for the competitive analysis of online algorithms. c © 2001 Else...
متن کاملA New Lower Bound for the List Update
The optimal competitive ratio for a randomized online list update algorithm is known to be at least 1.5 and at most 1.6, but the remaining gap is not yet closed. We present a new lower bound of 1.50084 for the partial cost model. The construction is based on game trees with incomplete information, which seem to be generally useful for the competitive analysis of online algorithms.
متن کاملA Lower Bound for Quantum Search of an Ordered List
It is known that a quantum computer can search an unordered list of N items using O(p N) look-ups, which is quadratically faster than any classical algorithm. We examine the case where the list is ordered, and show that no quantum computer can do with fewer than (p log N = log log N) look-ups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1999
ISSN: 0364-9024,1097-0118
DOI: 10.1002/(sici)1097-0118(199912)32:4<390::aid-jgt6>3.0.co;2-d